package queuedemo;

/**
 * @Author 12629
 * @Description：
 */
public class MyCycleQueue3 {
    public int[] elem;
    public int usedSize;

    public int front;
    public int rear;

    public boolean flg;//默认是false

    public MyCycleQueue3(int k) {
        elem = new int[k];
    }
    //入队列
    public boolean enQueue(int value) {
        if(isFull()) {
            return false;
        }
        elem[rear] = value;
        rear = (rear+1)%elem.length;
        flg = true;
        return true;
    }
    //出队列
    public boolean deQueue() {
        if(isEmpty()) {
            return false;
        }
        front = (front+1)%elem.length;
        flg = false;
        return true;
    }

    //获取队头元素
    public int Front() {
        if(isEmpty()) {
            return -1;
        }
        return elem[front];
    }

    //获取队尾元素
    public int Rear() {
        if(isEmpty()) {
            return -1;
        }
        int index = (rear == 0) ? elem.length-1 : rear-1;
        return elem[index];
    }

    public boolean isEmpty() {
        if(front == rear && !flg) {
            return true;
        }
        return false;
    }

    public boolean isFull() {
        if(front == rear && flg) {
            return true;
        }
        return false;
    }
}
